Optimizing Trading Decisions for Hydro Storage Systems Using Approximate Dual Dynamic Programming
نویسندگان
چکیده
منابع مشابه
Optimizing Trading Decisions for Hydro Storage Systems Using Approximate Dual Dynamic Programming
We propose a new approach to optimize operations of hydro storage systems with multiple connected reservoirs which participate in wholesale electricity markets. Our formulation integrates short-term intraday with long-term interday decisions. The intraday problem considers bidding decisions as well as storage operation during the day and is formulated as a stochastic program. The interday probl...
متن کاملApproximate Dynamic Programming for Optimizing Oil Production
In this chapter, a new ADP algorithm integrating (1) systematic basis function construction, (2) a linear programming (LP) approach in DP, (3) adaptive basis function selection and (4) bootstrapping, is developed and applied to oil production problems. The procedure requires the solution of a large-scale dynamic system, which is accomplished using a subsurface flow simulator, for function evalu...
متن کاملApproximate Dynamic Programming for Storage Problems
Storage problems are an important subclass of stochastic control problems. This paper presents a new method, approximate dynamic programming for storage, to solve storage problems with continuous, convex decision sets. Unlike other solution procedures, ADPS allows math programming to be used to make decisions each time period, even in the presence of large state variables. We test ADPS on the d...
متن کاملOptimal Day-Ahead Trading and Storage of Renewable Energies - An Approximate Dynamic Programming Approach
A renewable power producer who trades on a day-ahead market sells electricity under supply and price uncertainty. Investments in energy storage mitigate the associated financial risks and allow for decoupling the timing of supply and delivery. This paper introduces a model of the optimal bidding strategy for a hybrid system of renewable power generation and energy storage. We formulate the prob...
متن کاملQuadratic approximate dynamic programming for inputaffine systems
We consider the use of quadratic approximate value functions for stochastic control problems with inputaffine dynamics and convex stage cost and constraints. Evaluating the approximate dynamic programming policy in such cases requires the solution of an explicit convex optimization problem, such as a quadratic program, which can be carried out efficiently. We describe a simple and general metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2013
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.2013.1182